Using 2-Opt based evolution strategy for travelling salesman problem
نویسندگان
چکیده
منابع مشابه
An Improved Ant Colony Algorithm Based on 3-opt and Chaos for Travelling Salesman Problem
This paper presents an improved chaotic ant colony system algorithm (ICACS) for solving combinatorial optimization problems. The existing algorithms still have some imperfections, we use a combination of two different operators to improve the performance of algorithm in this work. First, 3-opt local search is used as a framework for the implementation of the ACS to improve the solution quality;...
متن کاملImprovements to the Or-opt heuristic for the symmetric travelling salesman problem
Several variants and generalizations of the Or-opt heuristic for the Symmetric Traveling Salesman Problem are developed and compared on random and planar instances. Some of the proposed algorithms are shown to significantly improve upon the standard 2-opt and Or-opt heuristics.
متن کاملPopulation-Based Optimization Algorithms for Solving the Travelling Salesman Problem
The Travelling Salesman Problem or the TSP is a representative of a large class of problems known as combinatorial optimization problems. In the ordinary form of the TSP, a map of cities is given to the salesman and he has to visit all the cities only once to complete a tour such that the length of the tour is the shortest among all possible tours for this map. The data consist of weights assig...
متن کاملAnt colonies for the travelling salesman problem.
We describe an artificial ant colony capable of solving the travelling salesman problem (TSP). Ants of the artificial colony are able to generate successively shorter feasible tours by using information accumulated in the form of a pheromone trail deposited on the edges of the TSP graph. Computer simulations demonstrate that the artificial ant colony is capable of generating good solutions to b...
متن کاملCombining 2-opt, 3-opt and 4-opt with K-swap-kick Perturbations for the Traveling Salesman Problem
The Traveling Salesman Problem (TSP) is a famous NP-hard problem typically solved using various heuristics. One of popular heuristics class is k-opt local search. Though these heuristics are quite simple, combined with other techniques in an iterated local search (ILS) framework they show promising results. In this paper, we propose to combine the 2-opt, 3-opt and 4-opt local search algorithms ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: An International Journal of Optimization and Control: Theories & Applications (IJOCTA)
سال: 2016
ISSN: 2146-5703,2146-0957
DOI: 10.11121/ijocta.01.2016.00268